Genetic algorithm and Monte Carlo simulation for a stochastic capacitated disassembly lot-sizing problem under random lead times
نویسندگان
چکیده
The purpose of this research is to propose several optimization methods for the stochastic multi-period disassembly lot-sizing problem. case one type end-of-life product and a two-level system studied. lead times are discrete random variables with known bounded probability distribution. objective optimize expected value total cost, which sum setup overload inventory holding cost backlogging cost. Three approaches were developed solve studied problem: (i) two-stage mixed-integer linear programming model based on all possible scenarios small instances, (ii) sample average approximation approach Monte Carlo simulation medium-scale instances and, (iii) an genetic algorithm large-scale instances. Experimental results show effectiveness proposed models can be used support decision-making replenishment plans.
منابع مشابه
Stochastic Lot-sizing Problem with Random Lead Times
We give multi-stage stochastic programming formulations for lot-sizing problems where costs, demands and order lead times follow a general discrete-time stochastic process with finite support. We characterize the properties of an optimal solution and give a dynamic programming algorithm, polynomial in input size, when orders do not cross in time.
متن کاملA Capacitated Lot Sizing Problem with Stochastic Setup Times
In this paper, we study a Capacitated Lot Sizing Problem with Stochastic Setup Times (CLSP-SST).We describe a mathematical model that considers both regular costs (including production, setup and inventory holding costs) and expected overtime costs (related to the excess usage of capacity). The CLSP-SST is formulated as a two-stage stochastic programming problem. A procedure is proposed to effe...
متن کاملParallel Genetic Algorithm for the Capacitated Lot-Sizing Problem
A parallel genetic algorithm is presented to solve the well-known ca-pacitated lot-sizing problem. The approach is implemented on a massively parallel single instruction multiple data architecture with 16384 4-bit processors. Based on a random keys representation a schedule is backward oriented obtained which enables us to apply a very simple capacity check. Genetic algorithms are a general pur...
متن کاملA hybrid ant colony optimization algorithm to optimize capacitated lot-sizing problem
The economical determination of lot size with capacity constraints is a frequently complex, problem in the real world. In this paper, a multi-level problem of lotsizing with capacity constraints in a finite planning horizon is investigated. A combination of ant colony algorithm and a heuristic method called shifting technique is proposed for solving the problem. The parameters, including the co...
متن کاملApproximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times
We develop new algorithmic approaches to compute provably near-optimal policies for multi-period stochastic lot-sizing inventory models with positive lead times, general demand distributions and dynamic forecast updates. The policies that are developed have worst-case performance guarantees of 3 and typically perform very close to optimal in extensive computational experiments. The newly propos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Industrial Engineering
سال: 2021
ISSN: ['0360-8352', '1879-0550']
DOI: https://doi.org/10.1016/j.cie.2021.107468